翻訳と辞書
Words near each other
・ MacDonald Letter
・ MacDonald ministry
・ Macdonald Monument
・ MacDonald Motorsports
・ MacDonald Mukansi
・ MacDonald Nunataks
・ MacDonald of Ardnamurchan
・ MacDonald of Glencoe
・ MacDonald P. Jackson
・ MacDonald Park
・ MacDonald Park (British Columbia)
・ MacDonald Park, South Australia
・ MacDonald Pass
・ MacDonald Peak
・ MacDonald Point
Macdonald polynomials
・ Macdonald Randolph Hotel
・ Macdonald Realty
・ Macdonald River
・ Macdonald River (Bendemeer)
・ Macdonald River (St Albans)
・ MacDonald S-20
・ Macdonald School
・ MacDonald Sembereka
・ MacDonald sisters
・ Macdonald Smith
・ MacDonald Spur
・ Macdonald Stewart Art Centre
・ MacDonald Taylor
・ MacDonald Taylor, Jr.


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Macdonald polynomials : ウィキペディア英語版
Macdonald polynomials

In mathematics, Macdonald polynomials ''P''λ(''x''; ''t'',''q'') are a family of orthogonal polynomials in several variables, introduced by . Macdonald originally associated his polynomials with weights λ of finite root systems and used just one variable ''t'', but later realized that it is more natural to associate them with affine root systems rather than finite root systems, in which case the variable ''t'' can be replaced by several different variables ''t''=(''t''1,...,''t''''k''), one for each of the ''k'' orbits of roots in the affine root system. The Macdonald polynomials are polynomials in ''n'' variables ''x''=(''x''1,...,''x''''n''), where ''n'' is the rank of the affine root system. They generalize many other families of orthogonal polynomials, such as Jack polynomials and Hall–Littlewood polynomials and Askey–Wilson polynomials, which in turn include most of the named 1-variable orthogonal polynomials as special cases. Koornwinder polynomials are Macdonald polynomials of certain non-reduced root systems. They have deep relationships with affine Hecke algebras and Hilbert schemes, which were used to prove several conjectures made by Macdonald about them.
==Definition==
First fix some notation:
*''R'' is a finite root system in a real vector space ''V''.
*''R+'' is a choice of positive roots, to which corresponds a positive Weyl chamber.
*''W'' is the Weyl group of ''R''.
*''Q'' is the root lattice of ''R'' (the lattice spanned by the roots).
*''P'' is the weight lattice of ''R'' (containing ''Q'').
* An ordering on the weights: \mu \le \lambda if and only if \lambda-\mu is a nonnegative linear combination of simple roots.
*''P+'' is the set of dominant weights: the elements of ''P'' in the positive Weyl chamber.
*ρ is the Weyl vector: half the sum of the positive roots; this is a special element of ''P''+ in the interior of the positive Weyl chamber.
*''F'' is a field of characteristic 0, usually the rational numbers.
*''A'' = ''F''(''P'') is the group algebra of ''P'', with a basis of elements written ''e''λ for λ ∈ ''P''.
* If ''f'' = ''e''λ, then ''f'' means ''e''−λ, and this is extended by linearity to the whole group algebra.
*''m''μ = Σλ ∈ ''W''μ''e''λ is an orbit sum; these elements form a basis for the subalgebra ''A''''W'' of elements fixed by ''W''.
*(a;q)_\infty = \prod_(1-aq^r), the infinite q-Pochhammer symbol.
*\Delta= \prod_ .
*\langle f,g\rangle=(\textf \overline g \Delta)/|W| is the inner product of two elements of ''A'', at least when ''t'' is a positive integer power of ''q''.
The Macdonald polynomials ''P''λ for λ ∈ ''P''+ are uniquely defined by the following two conditions:
:P_\lambda=\sum_u_m_\mu where ''u''λμ is a rational function of ''q'' and ''t'' with ''u''λλ = 1;
: ''P''λ and ''P''μ are orthogonal if λ < μ.
In other words, the Macdonald polynomials are obtained by orthogonalizing the obvious basis for ''A''''W''. The existence of polynomials with these properties is easy to show (for any inner product). A key property of the Macdonald polynomials is that they are orthogonal: 〈''P''λ, ''P''μ〉 = 0 whenever λ ≠ μ. This is not a trivial consequence of the definition because ''P''+ is not totally ordered, and so has plenty of elements that are incomparable. Thus one must check that the corresponding polynomials are still orthogonal. The orthogonality can be proved by showing that the Macdonald polynomials are eigenvectors
for an algebra of commuting self adjoint operators with 1-dimensional eigenspaces, and using the fact that eigenspaces for different eigenvalues must be orthogonal.
In the case of non-simply-laced root systems (B, C, F, G), the parameter ''t'' can be chosen to vary with the length of the root, giving a three-parameter family of Macdonald polynomials. One can also extend the definition to the nonreduced root system BC, in which case one obtains a six-parameter family (one ''t'' for each orbit of roots, plus ''q'') known as Koornwinder polynomials. It is sometimes better to regard Macdonald polynomials as depending on a possibly non-reduced affine root system. In this case there is one parameter ''t'' associated to each orbit of roots in the affine root system, plus one parameter ''q''. The number of orbits of roots can vary from 1 to 5.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Macdonald polynomials」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.